Solution of sparse positive definite systems on a shared-memory multiprocessor
نویسندگان
چکیده
منابع مشابه
Simulation of Parallel Computer Systems on a Shared-Memory Multiprocessor
This paper describes an object oriented simulator model for parallel computer systems that is designed for a shared memory multiprocessor and uses the principle of execution driven simulation. We present and evaluate two alternatives for structuring the simulation. The first of these uses a single shared event list object and treats all processes uniformly. In the second, we represent the paral...
متن کاملThe Exact Solution of Linear Equation Systems on a Shared Memory Multiprocessor
We describe the design of a parallel algorithm for the exact solution of linear equation systems with integer coeecients and the implementation of this algorithm on a shared memory multiprocessor. An eecient solution of the original problem is dii-cult since the coeecients grow during the computation and arithmetic becomes very time-consuming. Therefore we transform the problem into a problem o...
متن کاملModeling Shared-Memory Multiprocessor Systems with AADL
Multiprocessor chips are now commonly supplied by IC manufacturers. Real-time applications based on this kind of execution platforms are difficult to develop for many reasons: complexity, design space, unpredictability, ... The allocation of the multiple hardware resources to the software entities could have a great impact on the final result. Then, if the interest to represent the set of hardw...
متن کاملEfficient ICCG on a Shared Memory Multiprocessor
In this paper we discuss different approaches for exploiting parallelism in the ICCG method for solving large sparse symmetric positive ,lefinite systems of equations on a shared memory parallel computer. Techniques for efficiently solving triangular systems and computing sparse matrix-vector prodm:ts are explored. Three methods for scheduling the tasks in solving triangular systems are impleme...
متن کاملVerifying Sequential Consistency on Shared-Memory Multiprocessor Systems
In shared-memory multiprocessors sequential consistency o ers a natural tradeo between the exibility a orded to the implementor and the complexity of the programmer's view of the memory. Sequential consistency requires that some interleaving of the local temporal orders of read/write events at di erent processors be a trace of serial memory. We develop a systematic methodology for proving seque...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Parallel Programming
سال: 1986
ISSN: 0885-7458,1573-7640
DOI: 10.1007/bf01407878